Time Dependent Biased Random Walks
نویسندگان
چکیده
We study the biased random walk where at each step of a "controller" can, with certain small probability, move to an arbitrary neighbour. This model was introduced by Azar et al. [STOC'1992]; we extend their work time dependent setting and consider cover times this walk. obtain new bounds on hitting times. conjectured that controller can increase stationary probability vertex from $p$ $p^{1-\epsilon}$; while conjecture is not true in full generality, propose best-possible amended version confirm it for broad class graphs. also problem computing optimal strategy minimise show directed graphs determining PSPACE-complete.
منابع مشابه
First Passage Time Problem for Biased Continuous-time Random Walks
We study the first passage time (FPT) problem for biased continuous time random walks. Using the recently formulated framework of fractional Fokker-Planck equations, we obtain the Laplace transform of the FPT density function when the bias is constant. When the bias depends linearly on the position, the full FPT density function is derived in terms of Hermite polynomials and generalized Mittag-...
متن کاملBiased Random Walks in Biology
Random walks are used to describe the trajectories of many motile animals and microorganisms. They are a useful tool for both qualitative and quantitative descriptions of the behaviour of such creatures. Simple diffusive random walk models, or position jump processes, are unrealistic as they allow for effectively infinite propagation and do not take into account correlation between steps. Othme...
متن کاملSurvival probabilities in time-dependent random walks.
We analyze the dynamics of random walks in which the jumping probabilities are periodic time-dependent functions. In particular, we determine the survival probability of biased walkers who are drifted towards an absorbing boundary. The typical lifetime of the walkers is found to decrease with an increment in the oscillation amplitude of the jumping probabilities. We discuss the applicability of...
متن کاملBiased Random Walks on Galton - Watson Trees
We consider random walks with a bias toward the root on the family tree T of a supercritical Galton-Watson branching process and show that the speed is positive whenever the walk is transient. The corresponding harmonic measures are carried by subsets of the boundary of dimension smaller than that of the whole boundary. When the bias is directed away from the root and the extinction probability...
متن کاملBounds on Biased and Unbiased Random Walks
We analyze several random random walks on one-dimensional lattices using spectral analysis and probabilistic methods. Through our analysis, we develop insight into the pre-asymptotic convergence of Markov chains.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2022
ISSN: ['1549-6333', '1549-6325']
DOI: https://doi.org/10.1145/3498848